A Proof of Coincidence of Labeled Bisimilarity and Observational Equivalence in Applied Pi Calculus
نویسنده
چکیده
However, this problem can be fixed by requiring active substitutions be defined on the base sort only (see, for instance, [3]). The purpose of this note is to supply a proof for the theorem. In the original semantics in [1], the use of structural equivalence introduces many possibilities and makes it difficult to write a rigorous proof. To overcome the difficulty we shall use intermediate semantics, originally proposed in [3], as a bridge. Four equivalences will be discussed:
منابع مشابه
On the Coincidence of Observational Equivalence and Labeled Bisimilarity in Applied Pi Calculus
However, this problem can be fixed by requiring active substitutions be defined on the base sort only (see, for instance, [2]). The purpose of this note is to supply a proof for the theorem. In the original semantics in [1], the use of structural equivalence introduces the nondeterminism, which makes it difficult to write a rigorous proof. To overcome the difficulty we shall use intermediate se...
متن کاملStateful Applied Pi Calculus
We extend the applied pi calculus with state cells, which are used toreason about protocols that store persistent information. Examples are protocolsinvolving databases or hardware modules with internal state. We distinguish be-tween private state cells, which are not available to the attacker, and public statecells, which arise when a private state cell is compromised by the at...
متن کاملA pure labeled transition semantics for the applied pi calculus
The applied pi calculus proposed by Abadi and Fournet is successful in the analysis of security protocols. Its semantics mainly depends on several structural rules. Structural rules are convenient for specification, but inefficient for implementation. In this paper, we establish a new semantics for applied pi calculus based upon pure labeled transition system and propose a new formulation of la...
متن کاملProof System for Applied Pi Calculus
A symbolic-style proof system is presented to reason about observational equivalence for applied pi-calculus. The proofs of the soundness and completeness of the system rely on a recently developed theory of symbolic bisimulation for applied pi-calculus. The completeness result of the proof system is restricted to the finite fragment of applied pi-calculus which admits finite partition, and it ...
متن کاملA Note on Logical Relations Between Semantics and Syntax
This note gives a new proof of the ‘operational extensionality’ property of Abramsky’s lazy lambda calculus—namely the coincidence of contextual equivalence with a co-inductively defined notion of ‘applicative bisimilarity’. This purely syntactic result is here proved using a logical relation (due to Plotkin) between the syntax and its denotational semantics. The proof exploits a mixed inductiv...
متن کامل